WEAK PARETO OPTIMALITY OF MULTIOBJECTIVE PROBLEM IN A BANACH SPACE

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weak Pareto Optimality of Multiobjective Problem in a Banach Space

In the previous paper ([5]), we studied the ordinary multiobjective convex program on a locally convex linear topological space in the case that the objective functions and the constraint functions were continuous and convex, but not always Gateaux differ entiable. In the case, we showed that the generalized Kuhn-Tucker conditions given by a subdifferential formula were necessary and sufficient...

متن کامل

On Weak Pareto Optimality for Pseudoconvex Nonsmooth Multiobjective Optimization Problems

The purpose of this paper is to characterize the weak Pareto optimality for multiobjective pseudoconvex problem. In fact, it is a first order optimality characterization that generalize the Karush-Kuhn-Tucker condition. Moreover, this work is an extension of the single-objective case [6] to the multiobjective one with pseudoconvex continuous functions. Mathematics Subject Classification: 46N10,...

متن کامل

Weak Banach-Saks property in the space of compact operators

For suitable Banach spaces $X$ and $Y$ with Schauder decompositions and‎ ‎a suitable closed subspace $mathcal{M}$ of some compact operator space from $X$ to $Y$‎, ‎it is shown that the strong Banach-Saks-ness of all evaluation‎ ‎operators on ${mathcal M}$ is a sufficient condition for the weak‎ ‎Banach-Saks property of ${mathcal M}$, where for each $xin X$ and $y^*in‎ ‎Y^*$‎, ‎the evaluation op...

متن کامل

Pareto optimality in the Roommates problem

We consider Pareto optimal matchings as a means of coping with instances of the Stable Roommates problem (SR) that do not admit a stable matching. Given an instance I of SR, we show that the problem of finding a maximum Pareto optimal matching is solvable in O( √ nα(m,n)m log n) time, where n is the number of agents and m is the total length of the preference lists in I. By contrast we prove th...

متن کامل

Relative Pareto minimizers for multiobjective problems: existence and optimality conditions

In this paper we introduce and study enhanced notions of relative Pareto minimizers to constrained multiobjective problems that are defined via several kinds of relative interiors of ordering cones and occupy intermediate positions between the classical notions of Pareto and weak Pareto efficiency /minimality. Using advanced tools of variational analysis and generalized differentiation, we esta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of Mathematical Statistics

سال: 1981

ISSN: 0007-4993

DOI: 10.5109/13145